Recursive List Decoding for Reed-Muller Codes
نویسندگان
چکیده
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures. For moderate lengths up to 512, near-optimum decoding with feasible complexity is obtained.
منابع مشابه
Recursive error correction for general Reed-Muller codes
Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric channel. A recursive decoding algorithm is designed that has complexity of order n log n and corrects most error patterns of weight (d ln d)/2. The presented algorithm outperforms other algorithms with nonexponential decoding complexity, which are known for RM codes. We evaluate code performance usi...
متن کاملList Decoding for Reed-Muller Codes and Its Application to Polar Codes
Gopalan, Klivans, and Zuckerman proposed a list-decoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using wellknown Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a natural genera...
متن کاملList Decoding of Reed-Muller Codes Based on a Generalized Plotkin Construction
Gopalan, Klivans, and Zuckerman proposed a listdecoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generaliza...
متن کاملList Decoding of q - ary Reed - Muller Codes 1 )
The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...
متن کاملThe List-Decoding Size of Reed-Muller Codes
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a distance parameter, we are interested in bounding the size of the list of Reed-Muller codewords that are within that distance from the received word. Previous bounds of Gopalan, Klivans and Zuckerman [4] on the list size of Reed-Muller codes apply only up to the minimum distance of the code. In this w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.05304 شماره
صفحات -
تاریخ انتشار 2017